Overview of the doubly-efficient interactive proof systems of RRR

نویسنده

  • Oded Goldreich
چکیده

We provide an overview of the doubly-efficient interactive proof systems of Reingold, Rothblum, and Rothblum (STOC, 2016). Recall that by their result, any set that is decidable in polynomial-time by an algorithm of space complexity s(n) ≤ n, has a constant-round interactive proof system in which the prover runs polynomial time and the verifier runs in time Õ(n).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Doubly-Efficient Interactive Proof Systems

An interactive proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier’s strategy can be implemented in almost-linear-time. Such proof systems, introduced by Goldwasser, Kalai, and Rothblum (JACM, 2015), make the benefits of interactive proof system available to real-life agents who are restricted to polynomial-time comput...

متن کامل

On the doubly-efficient interactive proof systems of GKR

We present a somewhat simpler variant of the doubly-efficient interactive proof systems of Goldwasser, Kalai, and Rothblum (JACM, 2015). Recall that these proof systems apply to logspace uniform sets in NC (or, more generally, to inputs that are acceptable by log-space uniform bounded-depth circuits, where the number of rounds in the proof system is linearly related to the depth of the circuit)...

متن کامل

Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets

A proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier’s strategy can be implemented in almost-linear-time. We present direct constructions of doubly-efficient interactive proof systems for problems in P that are believed to have relatively high complexity. Specifically, such constructions are presented for t-CLIQUE and...

متن کامل

A short overview of the electrical machines control based on Flatness-technique

Optimal linear controllers and high computational non-linear controllers are normally applied to control the nonlinear systems. Flatness control method is a control technique for linear systems as well as nonlinear systems by static and dynamic feedback namely as endogenous dynamic feedback. This method takes into account the non-linear behavior of the process while preventing complicated compu...

متن کامل

Neuro-fuzzy Sliding Mode Controller Based on a Brushless Doubly Fed Induction Generator

The combination of neural networks and fuzzy controllers is considered as the most efficient approach for different functions approximation, and indicates their ability to control nonlinear dynamical systems. This paper presents a hybrid control strategy called Neuro-Fuzzy Sliding Mode Control (NFSMC) based on the Brushless Doubly fed Induction Generator (BDFIG). This replaces the sliding surfa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2017